Rumor Spreading on Percolation Graphs
نویسندگان
چکیده
We study the relation between the performance of the randomized rumor spreading (push model) in a d-regular graph G and the performance of the same algorithm in the percolated graph Gp. We show that if the push model successfully broadcast the rumor within T rounds in the graph G then only (1 + ǫ)T rounds are needed to spread the rumor in the graph Gp when T = o (pd).
منابع مشابه
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading model. We exhibit a natural expansion property for networks which suffices to make quasirandom r...
متن کاملTight Bounds for Rumor Spreading with Vertex Expansion
We establish a bound for the classic PUSH-PULL rumor spreading protocol on arbitrary graphs, in terms of the vertex expansion of the graph. We show that O(log(n)/α) rounds suffice with high probability to spread a rumor from a single node to all n nodes, in any graph with vertex expansion at least α. This bound matches the known lower bound, and settles the question on the relationship between ...
متن کاملRumor spreading and vertex expansion
We study the relation between the rate at which rumors spread throughout a graph and the vertex expansion of the graph. We consider the standard rumor spreading protocol where every node chooses a random neighbor in each round and the two nodes exchange the rumors they know. For any n-node graph with vertex expansion α, we show that this protocol spreads a rumor from a single node to all other ...
متن کاملRumor Spreading in LiveJournal
Online social networks have gained importance in recent years. Furthermore, there is a need for designing smart applications for social networks which take into account the behaviour of dynamical processes over these networks. This requires structural knowledge of the network helpful in understanding the dynamical process. Here we study a broad category of such processes called rumor spreading ...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph G with n nodes such that, the protocol informs every node in O(log n) rounds with high probability, and uses Õ(log n) random bits in total. The runtime of our protocol is tight, and the randomness requirement o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.1044 شماره
صفحات -
تاریخ انتشار 2011